Bounds on Universal Sequences
نویسندگان
چکیده
Universal sequences for graphs, a concept introduced by Aleliunas [M. are studied. By letting U(d, n) denote the minimum length of a universal sequence for d-regular undirected graphs with n nodes, the latter paper has proved the upper bound U(d, n)= O(d2r log n) using a probabilistic argument. Here a lower bound of U(2, n)-(n log n) is proved from which U(d, n)-l'I(n log n) for all d is deduced. Also, for complete graphs U(n-1, n)=gl(n log n/log log n). An explicit construction of universal sequences for cycles (d 2) of length r/O(lgn) is given.
منابع مشابه
Lower Bounds on Universal Traversal Sequences Based on Chains of Length Five
Universal traversal sequences for cycles require length (n 1:43), improving the previous bound of (n 1:33). For d 3, universal traversal sequences for d-regular graphs require length (d 0:57 n 2:43). For constant d, the best previous bound was (n 2:33).
متن کاملUniversal Traversal Sequences with Backtracking
In this paper we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in [AKL+], but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we presen...
متن کاملA Universal Constant for Exponential Riesz Sequences
The aim of this paper is to study certain correlations between lower and upper bounds of exponential Riesz sequences, in particular between sharp lower and upper bounds, where we show that the product of the sharp bounds of an exponential Riesz sequence is bounded from above by a universal constant. The result is applied to the norms of coefficient and frame operators and their inverses.
متن کاملFinite memory universal predictability of binary sequences - Information Theory, 2003. Proceedings. IEEE International Symposium on
The problem of predicting the next outcome of an individual binary sequence under the constraint that the universal predictor has a finite memory, is explored. The loss function considered is the regular prediction (0 1, or Hamming distance) loss and the-main reference class is the set of constant predictors. We analyze the performance of deterministic timeinvariant K-state universal predictors...
متن کاملUniversal Finite Memory Coding of Binary Sequences
This work considers the problem of universal coding of binary sequences, where the universal encoder has limited memory. Universal coding refers to a situation where a single, universal, encoder can achieve the optimal performance for a large class of models or data sequences, without knowing the model in advance, and without tuning the encoder to the data. In the previous work on universal cod...
متن کاملUniversal Approximation of Interval-valued Fuzzy Systems Based on Interval-valued Implications
It is firstly proved that the multi-input-single-output (MISO) fuzzy systems based on interval-valued $R$- and $S$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy. A formula to compute the lower upper bounds on the number of interval-valued fuzzy sets needed to achieve a pre-specified approximation accuracy for an arbitrary multivariate con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 18 شماره
صفحات -
تاریخ انتشار 1989